Aleph1 and the Modal mu-Calculus

نویسندگان

  • Maria João Gouveia
  • Luigi Santocanale
چکیده

For a regular cardinal $\kappa$, a formula of the modal $\mu$-calculus is $\kappa$-continuous in a variable x if, on every model, its interpretation as a unary function of x is monotone and preserves unions of $\kappa$-directed sets. We define the fragment C $\aleph 1 (x) of the modal $\mu$-calculus and prove that all the formulas in this fragment are $\aleph 1-continuous. For each formula $\phi$(x) of the modal $\mu$-calculus, we construct a formula $\psi$(x) $\in$ C $\aleph 1 (x) such that $\phi$(x) is $\kappa$-continuous, for some $\kappa$, if and only if $\phi$(x) is equivalent to $\psi$(x). Consequently, we prove that (i) the problem whether a formula is $\kappa$-continuous for some $\kappa$ is decidable, (ii) up to equivalence, there are only two fragments determined by continuity at some regular cardinal: the fragment C $\aleph 0 (x) studied by Fontaine and the fragment C $\aleph 1 (x). We apply our considerations to the problem of characterizing closure ordinals of formulas of the modal $\mu$-calculus. An ordinal $\alpha$ is the closure ordinal of a formula $\phi$(x) if its interpretation on every model converges to its least fixed-point in at most $\alpha$ steps and if there is a model where the convergence occurs exactly in $\alpha$ steps. We prove that $\omega$ 1 , the least uncountable ordinal, is such a closure ordinal. Moreover we prove that closure ordinals are closed under ordinal sum. Thus, any formal expression built from 0, 1, $\omega$, $\omega$ 1 by using the binary operator symbol + gives rise to a closure ordinal.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Proof Theory of the Modal mu-Calculus

We study the proof theoretic relationship between several deductive systems for the modal mu-calculus. This results in a completeness proof for a system that is suitable for deciding the validity problem of the mu-calculus. Moreover, this provides a new proof theoretic proof for the finite model property of the mu-calculus.

متن کامل

for modal mu - calculus

We define analogues of modal Sahlqvist formulas for the modal mu-calculus, and prove a correspondence theorem for them.

متن کامل

Observational Mu-Calculus

We propose an extended modal mu-calculus to provide an ‘assembly language’ for modal logics for real time, value-passing calculi, and other extended models of computation.

متن کامل

Completeness for μ-calculi: a coalgebraic approach

We set up a generic framework for proving completeness results for variants of the modal mucalculus, using tools from coalgebraic modal logic. We illustrate the method by proving two new completeness results: for the graded mu-calculus (which is equivalent to monadic second-order logic on the class of unranked tree models), and for the monotone modal mu-calculus. Besides these main applications...

متن کامل

Algorithmic correspondence for intuitionistic modal mu-calculus, Part 1

Modal mu-calculus [5] is a logical framework combining simple modalities with fixed point operators, enriching the expressivity of modal logic so as to deal with infinite processes like recursion. It has a simple syntax, an easily given semantics, and is decidable. Many expressive modal and temporal logics such as PDL, CTL and CTL∗ can be seen as fragments of the modal mu-calculus. Sahlqvist-st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017